Approximate Counting by Sampling the Backtrack-free Search Space Vibhav Gogate and Rina Dechter Donald Bren School of Information and Computer Science, University of California, Irvine, CA 92697, {vgogate,dechter}@ics.uc

Source URL: sami.ics.uci.edu

• Computing
• Partial differential equations
• Importance sampling
• Variance reduction
• Lookup table
• Monte Carlo integration
• Boolean satisfiability problem
• Monte Carlo methods
• Theoretical computer science
• Mathematics

Exact Inference Algorithms Bucket-elimination COMPSCI 276, Fall 2014 Class 5: Rina Dechter (Reading: Dechter chapters 4 , Darwiche chapter 6, Dechter Section 3.4)

Source URL: www.ics.uci.edu

Exact Inference Algorithms for Probabilistic Reasoning; BTE and CTE COMPSCI 276, Fall 2014 Set 6: Rina Dechter

Source URL: www.ics.uci.edu

• Bayesian network
• Networks
• Tree decomposition
• Graph theory
• Graphical models
• Statistical models

AND/OR Cutset Conditioning Robert Mateescu and Rina Dechter School of Information and Computer Science University of California, Irvine, CA 92697 {mateescu, dechter}@ics.uci.edu

Source URL: www.ijcai.org

• Search algorithms
• Mathematics
• Bayesian statistics
• Statistical models
• Hybrid algorithm
• Combinatorial optimization
• Feedback vertex set
• Connectivity
• A* search algorithm
• Constraint programming
• Graph theory
• Theoretical computer science